Delay Aware Optimization of Multiplierless Linear Systems Using Two Term Continuous Arithmetic Extraction

ثبت نشده
چکیده

We present a technique for redundancy elimination in multiplierless linear systems, such that the critical path of the computations is not increased. To the best of our knowledge this is the only method that combines common subexpression elimination and delay optimization in one single step. We assume that all the constant multiplications are decomposed into additions/subtractions and shift operations, to be evaluated using two input adders and hardwired shifts. Our technique can be used for linear systems consisting of any number of variables, with different arrival times. Experimental results show the superiority of our technique over other known methods. Index Terms – delay optimization, common subexpression elimination, DSP transforms, multiplierless filters, logic

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous Optimization of Delay and Number of Operations in Multiplierless Implementation of Linear Systems

Many optimization techniques exist for the hardware implementation of multiplierless linear systems. These methods mainly reduce the number of additions and subtractions by eliminating common subexpressions. These optimizations can increase the critical path of the computations, which is unacceptable for high performance systems. In this work, we present a technique that controls the delay duri...

متن کامل

Simultaneous Optimization of Delay and Number of Operations in Multiplierless Implementation of Linear Systems

The problem of implementing linear systems in hardware by efficiently using shifts and additions instead of multiplications has been actively researched in the past. Most of the works have concentrated on reducing the number of operations by using different techniques for redundancy elimination and have not considered their effect on the delay of the transformed computations. In this paper, we ...

متن کامل

AIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems

The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...

متن کامل

Development of RMPC Algorithm for Compensation of Uncertain Time-Delay and Disturbance in NCS

In this paper‎, ‎a synthesis method based on robust model predictive control is developed for compensation of uncertain time-delays in networked control systems with bounded disturbance‎. ‎The proposed method uses linear matrix inequalities and uncertainty polytope to model uncertain time-delays and system disturbances‎. ‎The continuous system with time-delay is discretized using uncertainty po...

متن کامل

Algebraic Methods for Optimizing Constant Multiplications in Linear Systems

Constant multiplications can be efficiently implemented in hardware by converting them into a sequence of nested additions and shift operations. They can be optimized further by finding common subexpressions among these operations. In this work, we present algebraic methods for eliminating common subexpressions. Algebraic techniques are established in multi-level logic synthesis for the minimiz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005